Constant Congestion Window approach for TCP – effect on Fairness
نویسندگان
چکیده
This is an extension of the work done by Ghosh et al [1] whereby it was indicated that a fixed congestion window performs better than a TCP Reno implementation. This paper investigates the impact of this model on the fairness of connections and comes up with suggestion to improve this.
منابع مشابه
QTCP: An Optimized and Improved Congestion Control Algorithm of High-Speed TCP Networks
TCP researchers evaluated the performance and fairness of different TCP protocols on the basis of new algorithms. The new High-Speed Transport Control Protocols (HS-TCP) were developed but there are still many problems regarding to bandwidth utilization, throughput and packet loss rate. To overcome these problems Quick Transport Control Protocol (QTCP) algorithm based on optimizations of HS-TCP...
متن کاملEnhanced Rate-based Transmission control for TCP in ad hoc Networks
This paper studies TCP performance over multi-hop wireless ad hoc networks that use the IEEE 802.11 protocol as the access method. The aim is to improve the TCP fairness while keeping the algorithm as simple as possible, since in previous works the algorithm designs were more complicated. We propose a simple approach to improve fairness based on scheduling (pacing) new packets according to the ...
متن کاملAnalysis on Adjustment-Based TCP-Friendly Congestion Control: Fairness and Stability
In this paper, we focus on understanding the binomial congestion control algorithms, which is proposed in [11] and can generalize TCP-style additive-increase by increasing inversely proportional to a power k of the current window (for TCP, k=0) and generalize TCP-style multiplicative-decrease by decreasing proportional to a power l of the current window (for TCP, l=1). We discuss their global f...
متن کاملA Theory of Window-based Unicast Congestion Control
This work presents a comprehensive theoretical framework for window-based congestion control protocols that are designed to converge to fairness and efficiency. We first derive a sufficient condition for convergence to fairness. Using this, we show how fair window increase/decrease policies can be constructed from suitable pairs of monotonically non-decreasing functions. We show that well-studi...
متن کاملA New Fair Window Algorithm for ECN-Capable TCP (New-ECN)
In this paper we propose a modification of the Explicit Congestion Notification (ECN) [1] to correct the bias against connections with long round trip times (RTT) of TCP. The New-ECN algorithm achieves a fair sharing of the available bandwidth of a bottleneck gateway. The idea is to prevent a fast connection from opening its congestion window too quickly and to enable a slow connection to open ...
متن کامل